Fault Tolerant Hierarchical Con guration of Mesh Networks
نویسنده
چکیده
In an e ort to improve the overall performance of distributed mesh systems a hierar chical approach of dividing the processing units into logical levels has been proposed The scheme has been tested and shown to achieve substantial performance improvement in many situations This hierarchical con guration divides the mesh into progressively smaller clusters thus allowing for computation to occur in small local groups at the lower levels After local operations the results are passed to higher logical levels Un der certain assumptions this method has been shown to produce an overall minimal total communication cost for the entire system As the distributed mesh systems attempt to achieve optimal performance with this hierarchical con guration questions arise concerning the system s ability to handle node failure When using a hierarchical con guration certain elements in the mesh become more important to the overall system than others It is important that the hierarchical system have a re organizing mechanism in the case of node s failing to function in such a way that the performance gain from hierarchical con guration is salvaged as much as possible The fault tolerance problems considered in this project are concerned with minimiz ing the loss of performance in the system hierarchy due to the presence of failing nodes We will propose schemes algorithms for that purpose The performance results will be compared to that of an ideal fault free system The rst phase of the project will be to design strategies to reconstruct the hierarchy accommodating to the situation that some nodes in the original hierarchy are not functioning anymore To that end new local heads may be selected and local nodes regrouped In the second phase of the project simulation experiments will be developed to examine the e ectiveness of the proposed schemes Examples of both faulty and fault free hierarchical mesh systems will be tested to quantify how good the proposed schemes are Index Terms Distributed Processing Fault tolerance Hierarchical control Inter connection networks Mesh
منابع مشابه
Design of modular fault tolerant manipulators
In this paper, we deal with two important issues in relation to modular recon gurable manipulators, namely, the determination of the modular assembly con guration optimally suited to perform a speci c task and the synthesis of fault tolerant systems. We present a numerical approach yielding an assembly con guration that satis es four kinematic task requirements: reachability, joint limits, obst...
متن کاملArchitecture and Network-on-Chip Implementation of a New Hierarchical Interconnection Network
A Midimew-connected Mesh Network (MMN) is a minimal distance mesh with wrap-around links network of multiple basic modules (BMs), in which the BMs are 2D-mesh networks that are hierarchically interconnected for higher-level networks. In this paper, we present the architecture of the MMN, addressing of node, routing of message, and evaluate the static network performance of MMN, TESH, mesh and t...
متن کاملAlgorithm - Based Fault - Tolerant Strategies in FaultyHypercube and Star
This dissertation addresses the design of algorithm-based fault-tolerant strategies in faulty hypercube and star graph multicomputers without hardware modi cation. Several new concepts and designs are presented here under the permanent and transient fault models. Under the permanent fault model, we propose a new fault-tolerant recon guration scheme in the faulty hypercube and star graph multico...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملTree-Based Fault-Tolerant Multicast in Multicomputer Networks
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces signific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004